List total colorings of series-parallel graphs
نویسندگان
چکیده
منابع مشابه
List Total Colorings of Series-Parallel Graphs
A total coloring of a graph G is a coloring of all elements of G, i.e., vertices and edges, in such a way that no two adjacent or incident elements receive the same color. Let L(x) be a set of colors assigned to each element x of G. Then a list total coloring of G is a total coloring such that each element x receives a color contained in L(x). The list total coloring problem asks whether G has ...
متن کاملList Edge-Colorings of Series-Parallel Graphs
It is proved that for every integer k for every simple series parallel graph G with maximum degree at most k and for every collection L e e E G of sets each of size at least k there exists a proper edge coloring of G such that for every edge e E G the color of e belongs to L e
متن کاملList total colorings of graphs
We introduce the concept of list total colorings and prove that every multigraph of maximum degree 3 is 5-total-choosable. We also show that the total-choosability of a graph of maximum degree 2 is equal to its total chromatic number.
متن کاملSufficient Condition and Algorithm for List Total Colorings of Series-Parallel Graphs
A total coloring of a graph G is a coloring of all elements of G, i.e. vertices and edges, such that no two adjacent or incident elements receive the same color. Let L(x) be a set of colors assigned to each element x of G. Then a list total coloring of G is a total coloring such that each element x receives a color contained in L(x). The list total coloring problem asks whether G has a list tot...
متن کاملSome Results on List Total Colorings of Planar Graphs
Let G be a planar graph with maximum degree Δ. In this paper, it is proved that if Δ ≥ 9, then G is total-(Δ+2)-choosable. Some results on list total coloring of G without cycles of specific lengths are given.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2005
ISSN: 1570-8667
DOI: 10.1016/j.jda.2003.12.006